A max-norm constrained minimization approach to 1-bit matrix completion
نویسندگان
چکیده
We consider in this paper the problem of noisy 1-bit matrix completion under a general non-uniform sampling distribution using the max-norm as a convex relaxation for the rank. A max-norm constrained maximum likelihood estimate is introduced and studied. The rate of convergence for the estimate is obtained. Information-theoretical methods are used to establish a minimax lower bound under the general sampling model. The minimax upper and lower bounds together yield the optimal rate of convergence for the Frobenius norm loss. Computational algorithms and numerical performance are also discussed.
منابع مشابه
Social Trust Prediction via Max-norm Constrained 1-bit Matrix Completion
Social trust prediction addresses the significant problem of exploring interactions among users in social networks. Naturally, this problem can be formulated in the matrix completion framework, with each entry indicating the trustness or distrustness. However, there are two challenges for the social trust problem: 1) the observed data are with sign (1-bit) measurements; 2) they are typically sa...
متن کاملMatrix completion via max-norm constrained optimization
This paper studies matrix completion under a general sampling model using the max-norm as a convex relaxation for the rank of the matrix. The optimal rate of convergence is established for the Frobenius norm loss. It is shown that the max-norm constrained minimization method is rate-optimal and it yields a more stable approximate recovery guarantee, with respect to the sampling distributions, t...
متن کاملNear-optimal sample complexity for convex tensor completion
We analyze low rank tensor completion (TC) using noisy measurements of a subset of the tensor. Assuming a rank-$r$, order-$d$, $N \times N \times \cdots \times N$ tensor where $r=O(1)$, the best sampling complexity that was achieved is $O(N^{\frac{d}{2}})$, which is obtained by solving a tensor nuclear-norm minimization problem. However, this bound is significantly larger than the number of fre...
متن کاملA unified approach for minimizing composite norms
We propose a first-order augmented Lagrangian algorithm (FALC) to solve the composite norm minimizationproblemminX∈Rm×n μ1‖σ(F(X)−G)‖α +μ2‖C(X)− d‖β ,subject to A(X)− b ∈ Q,where σ(X) denotes the vector of singular values of X ∈ Rm×n, the matrix norm‖σ(X)‖α denotes either the Frobenius,the nuclear, or the `2-operator norm of X, the vector norm‖.‖β denotes either ...
متن کاملFixed Point and Bregman Iterative Methods for Matrix Rank Minimization
The linearly constrained matrix rank minimization problem is widely applicable in many fields such as control, signal processing and system identification. The tightest convex relaxation of this problem is the linearly constrained nuclear norm minimization. Although the latter can be cast as a semidefinite programming problem, such an approach is computationally expensive to solve when the matr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Machine Learning Research
دوره 14 شماره
صفحات -
تاریخ انتشار 2013